An FPT algorithm for edge subset feedback edge set
نویسندگان
چکیده
Given a graph G = (V,E) with a subset S ⊆ E of edges, the edge subset feedback edge set problem is to find a smallest set F of edges such that in G′ = (V,E − F ) no cycle contains an edge in S. We also define a restricted version of this problem, in which no edges in S is allowed to be selected into F to form a solution. In this paper, we give a linear-time algorithm for the edge subset feedback edge set problem, and show the restricted version is NP-hard for fixed |S| ≥ 2 and fixed-parameter tractable with parameter being k = |F |.
منابع مشابه
On Structural Parameterizations of the Edge Disjoint Paths Problem
In this paper we revisit the classical Edge Disjoint Paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting every terminal pair in P . Our focus lies on structural parameterizations for the problem that allow for efficient (polynomial-time or fpt) algorithms. As our first result, we...
متن کاملParameterized Complexity of Fair Deletion Problems
Edge deletion problems are those where given a graph G and a graph property π, the goal is to find a subset of edges such that after its removal the graph G will satisfy the property π. Typically, we want to minimize the number of edges removed. In fair deletion problem we change the objective: we minimize the maximum number of edges incident to a single vertex. We study the parameterized compl...
متن کاملCoordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a significantly improved FPT algorithm for the Maximum Leaf Spanning Tree problem. Furthermore, we sketch how the methods can be applied to a number of other well-known problems, including the parametric dual of Dominating Set (also known as Nonblocker), Matri...
متن کاملHalf-integrality, Lp-branching and Fpt Algorithms∗
A recent trend in parameterized algorithms is the application of polytope tools to FPT algorithms (e.g., Cygan et al., 2011; Narayanaswamy et al., 2012). Although this approach has yielded significant speedups for a range of important problems, it requires the underlying polytope to have very restrictive properties, including half-integrality and Nemhauser-Trotter-style persistence properties. ...
متن کاملSimultaneous Feedback Edge Set: A Parameterized Perspective
In a recent article Agrawal et al. (STACS 2016) studied a simultaneous variant of the classic Feedback Vertex Set problem, called Simultaneous Feedback Vertex Set (Sim-FVS). In this problem the input is an n-vertex graph G, an integer k and a coloring function col : E(G)→ 2[α], and the objective is to check whether there exists a vertex subset S of cardinality at most k in G such that for all i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 112 شماره
صفحات -
تاریخ انتشار 2012